Non-cyclic Sorts for First-Order Satisfiability
Identifieur interne : 001530 ( Main/Exploration ); précédent : 001529; suivant : 001531Non-cyclic Sorts for First-Order Satisfiability
Auteurs : Konstantin Korovin [Royaume-Uni]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper we investigate the finite satisfiability problem for first-order logic. We show that the finite satisfiability problem can be represented as a sequence of satisfiability problems in a fragment of many-sorted logic, which we call the non-cyclic fragment. The non-cyclic fragment can be seen as a generalisation of the effectively propositional fragment (EPR) in the many-sorted setting. We show that the non-cyclic fragment is decidable by instantiation-based methods and present a linear time algorithm for checking whether a given clause set is in this fragment. One of the distinctive features of our finite satisfiability translation is that it avoids unnecessary flattening of terms, which can be crucial for efficiency. We implemented our finite model finding translation in iProver and evaluated it over the TPTP library. Using our translation it was possible solve a large class of problems which could not be solved by other systems.
Url:
DOI: 10.1007/978-3-642-40885-4_15
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002650
- to stream Istex, to step Curation: 002617
- to stream Istex, to step Checkpoint: 000156
- to stream Main, to step Merge: 001542
- to stream Main, to step Curation: 001530
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Non-cyclic Sorts for First-Order Satisfiability</title><author><name sortKey="Korovin, Konstantin" sort="Korovin, Konstantin" uniqKey="Korovin K" first="Konstantin" last="Korovin">Konstantin Korovin</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A32B4E32D1801F8D4FAEBE8EE94D8A8E1DC44EF8</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40885-4_15</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-5WBWZMLX-9/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002650</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002650</idno><idno type="wicri:Area/Istex/Curation">002617</idno><idno type="wicri:Area/Istex/Checkpoint">000156</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000156</idno><idno type="wicri:doubleKey">0302-9743:2013:Korovin K:non:cyclic:sorts</idno><idno type="wicri:Area/Main/Merge">001542</idno><idno type="wicri:Area/Main/Curation">001530</idno><idno type="wicri:Area/Main/Exploration">001530</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Non-cyclic Sorts for First-Order Satisfiability</title><author><name sortKey="Korovin, Konstantin" sort="Korovin, Konstantin" uniqKey="Korovin K" first="Konstantin" last="Korovin">Konstantin Korovin</name><affiliation wicri:level="4"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>School of Computer Science, The University of Manchester</wicri:regionArea><placeName><settlement type="city">Manchester</settlement><region type="nation">Angleterre</region><region nuts="2" type="region">Grand Manchester</region></placeName><orgName type="university">Université de Manchester</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Royaume-Uni</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper we investigate the finite satisfiability problem for first-order logic. We show that the finite satisfiability problem can be represented as a sequence of satisfiability problems in a fragment of many-sorted logic, which we call the non-cyclic fragment. The non-cyclic fragment can be seen as a generalisation of the effectively propositional fragment (EPR) in the many-sorted setting. We show that the non-cyclic fragment is decidable by instantiation-based methods and present a linear time algorithm for checking whether a given clause set is in this fragment. One of the distinctive features of our finite satisfiability translation is that it avoids unnecessary flattening of terms, which can be crucial for efficiency. We implemented our finite model finding translation in iProver and evaluated it over the TPTP library. Using our translation it was possible solve a large class of problems which could not be solved by other systems.</div></front></TEI><affiliations><list><country><li>Royaume-Uni</li></country><region><li>Angleterre</li><li>Grand Manchester</li></region><settlement><li>Manchester</li></settlement><orgName><li>Université de Manchester</li></orgName></list><tree><country name="Royaume-Uni"><region name="Angleterre"><name sortKey="Korovin, Konstantin" sort="Korovin, Konstantin" uniqKey="Korovin K" first="Konstantin" last="Korovin">Konstantin Korovin</name></region><name sortKey="Korovin, Konstantin" sort="Korovin, Konstantin" uniqKey="Korovin K" first="Konstantin" last="Korovin">Konstantin Korovin</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001530 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001530 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:A32B4E32D1801F8D4FAEBE8EE94D8A8E1DC44EF8
|texte= Non-cyclic Sorts for First-Order Satisfiability
}}
| This area was generated with Dilib version V0.6.33. |  |